A Study on the Interaction Between Interscheme Property Extraction and Type Conflict Resolution

This paper aims at studying the interaction between the extraction of interscheme properties, such as synonymies, homonymies and type conflicts (which are exploited for dejining the semantics of involved schemes for integration purposes), and the resolution of type conjlicts. As a matter of facts, the transformations required by type conflict resolution could invalidate some of the detected interscheme properties. Here we propose a semi-automatic approach to face this problem, based on an iterative computation: each iteration of the computation derives interscheme properties, verifies i f at least one type conflict exists and, in the afJirmative case, modijies schemes for solving derived type conjicts. We prove that the number of iterations required by the computation to terminate is polynomial in the number of objects belonging to involved schemes.